Simplified instantaneous non-local quantum computation with applications to position-based cryptography
Identifieur interne : 000034 ( Main/Exploration ); précédent : 000033; suivant : 000035Simplified instantaneous non-local quantum computation with applications to position-based cryptography
Auteurs : Salman Beigi [États-Unis, Iran] ; Robert Knig [États-Unis]Source :
- New Journal of Physics [ 1367-2630 ] ; 2011.
Abstract
Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the related problem of multipartite quantum computation with local operations and a single round of classical communication. Compared to previously known techniques, our protocols reduce the entanglement consumption by an exponential amount. We also prove a linear lower bound on the amount of entanglement required for the implementation of a certain non-local measurement. These results relate to position-based cryptography: an amount of entanglement scaling exponentially with the number of communicated qubits is sufficient to render any such scheme insecure. Furthermore, we show that certain schemes are secure under the assumption that the adversary has less entanglement than a given bound and is restricted to classical communication.
Url:
DOI: 10.1088/1367-2630/13/9/093036
Affiliations:
Links toward previous steps (curation, corpus...)
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Simplified instantaneous non-local quantum computation with applications to position-based cryptography</title><author><name sortKey="Beigi, Salman" sort="Beigi, Salman" uniqKey="Beigi S" first="Salman" last="Beigi">Salman Beigi</name></author><author><name sortKey="Knig, Robert" sort="Knig, Robert" uniqKey="Knig R" first="Robert" last="Knig">Robert Knig</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2DC68A6B1D0DBAD60509709CB7757CB2913EF4C7</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1088/1367-2630/13/9/093036</idno><idno type="url">https://api.istex.fr/document/2DC68A6B1D0DBAD60509709CB7757CB2913EF4C7/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000566</idno><idno type="wicri:Area/Main/Curation">000566</idno><idno type="wicri:Area/Main/Exploration">000034</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Exploration">000034</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Simplified instantaneous non-local quantum computation with applications to position-based cryptography</title><author><name sortKey="Beigi, Salman" sort="Beigi, Salman" uniqKey="Beigi S" first="Salman" last="Beigi">Salman Beigi</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Institute for Quantum Information, Caltech, Pasadena, CA 91125</wicri:regionArea><wicri:noRegion>CA 91125</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Iran</country><wicri:regionArea>School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran</wicri:regionArea><wicri:noRegion>Tehran</wicri:noRegion></affiliation><affiliation></affiliation><affiliation></affiliation></author><author><name sortKey="Knig, Robert" sort="Knig, Robert" uniqKey="Knig R" first="Robert" last="Knig">Robert Knig</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Institute for Quantum Information, Caltech, Pasadena, CA 91125</wicri:regionArea><wicri:noRegion>CA 91125</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>IBM T J Watson Research Center, Yorktown Heights, NY 10598</wicri:regionArea><wicri:noRegion>NY 10598</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">New Journal of Physics</title><title level="j" type="abbrev">New J. Phys.</title><idno type="ISSN">1367-2630</idno><idno type="eISSN">1367-2630</idno><imprint><publisher>IOP Publishing</publisher><date type="published" when="2011">2011</date><biblScope unit="volume">13</biblScope><biblScope unit="issue">9</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="25">25</biblScope></imprint><idno type="ISSN">1367-2630</idno></series><idno type="istex">2DC68A6B1D0DBAD60509709CB7757CB2913EF4C7</idno><idno type="DOI">10.1088/1367-2630/13/9/093036</idno><idno type="articleID">384245</idno><idno type="articleNumber">093036</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1367-2630</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract">Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the related problem of multipartite quantum computation with local operations and a single round of classical communication. Compared to previously known techniques, our protocols reduce the entanglement consumption by an exponential amount. We also prove a linear lower bound on the amount of entanglement required for the implementation of a certain non-local measurement. These results relate to position-based cryptography: an amount of entanglement scaling exponentially with the number of communicated qubits is sufficient to render any such scheme insecure. Furthermore, we show that certain schemes are secure under the assumption that the adversary has less entanglement than a given bound and is restricted to classical communication.</div></front></TEI><affiliations><list><country><li>Iran</li><li>États-Unis</li></country></list><tree><country name="États-Unis"><noRegion><name sortKey="Beigi, Salman" sort="Beigi, Salman" uniqKey="Beigi S" first="Salman" last="Beigi">Salman Beigi</name></noRegion><name sortKey="Knig, Robert" sort="Knig, Robert" uniqKey="Knig R" first="Robert" last="Knig">Robert Knig</name><name sortKey="Knig, Robert" sort="Knig, Robert" uniqKey="Knig R" first="Robert" last="Knig">Robert Knig</name></country><country name="Iran"><noRegion><name sortKey="Beigi, Salman" sort="Beigi, Salman" uniqKey="Beigi S" first="Salman" last="Beigi">Salman Beigi</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amerique/explor/CaltechV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000034 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000034 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Amerique
|area= CaltechV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2DC68A6B1D0DBAD60509709CB7757CB2913EF4C7
|texte= Simplified instantaneous non-local quantum computation with applications to position-based cryptography
}}
| This area was generated with Dilib version V0.6.32. |  |